Exact and Approximate Determinization of Discounted-Sum Automata
نویسندگان
چکیده
منابع مشابه
Exact and Approximate Determinization of Discounted-Sum Automata
A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, valuing a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by λ, where the discount factor λ is a fixed rational number greater than 1. The value of a word is the minimal value of the automaton runs on it. Discounted summation is a co...
متن کاملApproximate Determinization of Quantitative Automata
Quantitative automata are nondeterministic finite automata with edge weights. They value a run by some function from the sequence of visited weights to the reals, and value a word by its minimal/maximal run. They generalize boolean automata, and have gained much attention in recent years. Unfortunately, important automaton classes, such as sum, discounted-sum, and limit-average automata, cannot...
متن کاملDeterminizing Discounted-Sum Automata
A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, which values a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by λ, where the discount factor λ is a fixed rational number greater than 1. Discounted summation is a common and useful measuring scheme, especially for infinite sequenc...
متن کاملDeterminization of Parity automata
A central result in the theory of ω-automata is McNaughton's Theorem which states that every Buchi automaton is equivalent to a deterministic Muller automaton. The complexity of McNaughton's algorithm is huge. Safra provided an optimal construction. Safra's algorithm converts a Buchi automaton with n states to a deterministic Rabin automaton with n states. Much e orts have been invested to redu...
متن کاملExact and approximate algorithms for discounted {0-1} knapsack problem
The D iscounted {0-1} K napsack P roblem (D{0-1}KP) is an extension of the classical 0-1 knapsack problem (0-1 KP) that consists of selecting a set of item groups where each group includes three items and at most one of the three items can be selected. The D{0-1}KP is more challenging than the 0-1 KP because four choices of items in an item group diversify the selection of the items. In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2014
ISSN: 1860-5974
DOI: 10.2168/lmcs-10(1:10)2014